Dynamic Decomposition of Service Function Chain Using a Deep Reinforcement Learning Approach

نویسندگان

چکیده

The Internet of Things (IoT) universe will continue to expand with the advent sixth generation mobile networks (6G), which is expected support applications and services higher data rates, ultra-reliability, lower latency compared fifth (5G). These new demanding 6G introduce heavy load strict performance requirements on network. Network Function Virtualization (NFV) a promising approach handling these challenging requirements, but it also poses significant Resource Allocation (RA) challenges. Especially since network be highly complicated comparatively short-lived, operators compelled deploy in flexible, on-demand, agile manner. To address aforementioned issues, microservice approaches are being investigated, decomposed loosely coupled, resulting increased deployment flexibility modularity. This study investigates RA for microservices-based NFV efficient decomposition Virtual (VNF) onto substrate networks. VNFs involves additional overheads, have detrimental impact resources; hence, finding right balance when how much allow critical. Thus, we develop criterion determining potential/candidate granularity such decomposition. joint problem embedding microservices model solve using exact mathematical models. Therefore, implemented Reinforcement Learning (RL) Double Deep Q-Learning, revealed an almost 50% more normalized Service Acceptance Rate (SAR) over monolithic VNFs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Reinforcement - Learning Approach to Service

In this paper we address the problem of service directory placement in wireless ad-hoc networks. In particular, we introduce the Service Directory Placement Protocol, or SDPP, which enables directory-based service discovery in wireless adhoc networks. In our approach, the service directory is moved from one host to another in response to the dynamics of a service discovery overlay system and th...

متن کامل

Deep Reinforcement Learning for Dynamic Multichannel Access

We consider the problem of dynamic multichannel access in a Wireless Sensor Network (WSN) containing N correlated channels, where the states of these channels follow a joint Markov model. A user at each time slot selects a channel to transmit a packet and receives a reward based on the success or failure of the transmission, which is dictated by the state of the selected channel. The objective ...

متن کامل

Operation Scheduling of MGs Based on Deep Reinforcement Learning Algorithm

: In this paper, the operation scheduling of Microgrids (MGs), including Distributed Energy Resources (DERs) and Energy Storage Systems (ESSs), is proposed using a Deep Reinforcement Learning (DRL) based approach. Due to the dynamic characteristic of the problem, it firstly is formulated as a Markov Decision Process (MDP). Next, Deep Deterministic Policy Gradient (DDPG) algorithm is presented t...

متن کامل

Learning how to Active Learn: A Deep Reinforcement Learning Approach

Active learning aims to select a small subset of data for annotation such that a classifier learned on the data is highly accurate. This is usually done using heuristic selection methods, however the effectiveness of such methods is limited and moreover, the performance of heuristics varies between datasets. To address these shortcomings, we introduce a novel formulation by reframing the active...

متن کامل

A Causal Approach to Hierarchical Decomposition in Reinforcement Learning

A CAUSAL APPROACH TO HIERARCHICAL DECOMPOSITION IN REINFORCEMENT LEARNING

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3215744